Convergence of Dual Algorithm with Arbitrary Communication Delays

نویسندگان

  • Richard J. La
  • Priya Ranjan
چکیده

We study the issue of convergence of user rates and resource prices under a family of rate controlschemes called dual algorithms with arbitrary communication delays. We first consider a case where asingle resource is shared by many users. Then, we study a general network shared by heterogeneoususers and derive sufficient conditions for convergence. We show that in the case of a single user utilizinga single resource, our condition is also necessary. Using our results we derive a sufficient conditionfor convergence with a family of popular utility and resource price functions. We present numericalexamples to validate our analysis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decentralized Multi-Agent Optimization Via Dual Decomposition

We study a distributed multi-agent optimization problem of minimizing the sum of convex objective functions. A new decentralized optimization algorithm is introduced, based on dual decomposition, together with the subgradient method for finding the optimal solution. The iterative algorithm is implemented on a multi-hop network and is designed to handle communication delays. The convergence of t...

متن کامل

Network Constrained Distributed Dual Coordinate Ascent for Machine Learning

With explosion of data size and limited storage space at a single location, data are often distributed at different locations. We thus face the challenge of performing largescale machine learning from these distributed data through communication networks. In this paper, we study how the network communication constraints will impact the convergence speed of distributed machine learning optimizat...

متن کامل

Distributed Multi-Agent Optimization via Dual Decomposition

In this master thesis, a new distributed multi-agent optimization algorithm is introduced. The algorithm is based upon the dual decomposition of the optimization problem, together with the subgradient method for finding the optimal dual solution. The convergence of the new optimization algorithm is proved for communication networks with bounded timevarying delays, and noisy communication. Furth...

متن کامل

Average Consensus in the Presence of Dynamically Changing Directed Graph Topologies and Time Delays

We have recently proposed a robustified ratio consensus algorithm which achieves asymptotic convergence to the global average in a distributed fashion in static strongly connected digraphs, despite the possible presence of bounded but otherwise arbitrary delays. In this work, we propose a protocol which reaches asymptotic convergence to the global average in a distributed fashion under possible...

متن کامل

Distributed stochastic consensus of multi-agent systems with noisy and delayed measurements

Networked systems are often subject to environmental uncertainties and communication delays, which make timely and accurate information exchange among neighbours difficult or impossible. This study investigates the distributed consensus problem of dynamical networks of multi-agents in which each agent can only obtain noisy and delayed measurements of the states of its neighbours. The authors co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM Journal of Applied Mathematics

دوره 68  شماره 

صفحات  -

تاریخ انتشار 2008